Light orthogonal networks with constant geometric dilation
نویسندگان
چکیده
منابع مشابه
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal network for a given set of n points in the plane is an axis-aligned planar straight line graph that connects all input points. We show that for any set of n points in the plane, there is an orthogonal network that (i) is short having a total edge length of O(jT j), where jT j denotes the length of a minimum Euclidean spanning tree for the point set; (ii) is small having O(n) verti...
متن کاملLaying Out Midimew Networks with Constant Dilation
Abst rac t . Midimew networks [1] are mesh-connected networks derived from a subset of degree-4 circulant graphs. They have minimum diameter and average distance among all degree-4 circulant graphs, and are better than some of the most common topologies for parallel computers in terms of various cost measures. Among the many midimew networks, the rectangular ones appear to be most suitable for ...
متن کاملOrthogonal Multiwavelets with Dilation Factor a
There are perfect construction formulas for the orthonormal uniwavelet. However, it seems that there is not such a good formula with similar structure for multiwavelets. Especially, construction of multiwavelets with dilation factor a(a ≥ 2, a ∈ Z) lacks effective methods. In this paper, a procedure for constructing compactly supported orthonormal multiscale functions is first given, and then b...
متن کاملRoute Discovery with Constant Memory in Oriented Planar Geometric Networks
We address the problem of discovering routes in strongly connected planar geometric networks with directed links. We consider two types of directed planar geometric networks: Eulerian (in which every vertex has the same number of ingoing and outgoing edges) and outerplanar (in which a single face contains all the vertices of the network). Motivated by the necessity for establishing communicatio...
متن کاملSparse Geometric Graphs with Small Dilation
Given a set S of n points in R, and an integer k such that 0 6 k < n, we show that a geometric graph with vertex set S, at most n− 1 + k edges, maximum degree five, and dilation O(n/(k + 1)) can be computed in time O(n log n). For any k, we also construct planar n-point sets for which any geometric graph with n− 1 + k edges has dilation Ω(n/(k + 1)); a slightly weaker statement holds if the poi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2009
ISSN: 1570-8667
DOI: 10.1016/j.jda.2008.07.007